Calculation of orthant probabilities by the holonomic gradient method
نویسندگان
چکیده
We apply the holonomic gradient method (HGM) introduced by [9] to the calculation of orthant probabilities of multivariate normal distribution. The holonomic gradient method applied to orthant probabilities is found to be a variant of Plackett’s recurrence relation ([14]). However an implementation of the method yields recurrence relations more suitable for numerical computation than Plackett’s recurrence relation. We derive some theoretical results on the holonomic system for the orthant probabilities. These results show that multivariate normal orthant probabilities possess some remarkable properties from the viewpoint of holonomic systems. Finally we show that numerical performance of our method is comparable or superior compared to existing methods.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Calculation of Orthant Probabilities by the Holonomic Gradient Method
We apply the holonomic gradient method (HGM) introduced by [9] to the calculation of orthant probabilities of multivariate normal distribution. The holonomic gradient method applied to orthant probabilities is found to be a variant of Plackett’s recurrence relation ([14]). However a straightforward implementation of the method yields recurrence relations more suitable for numerical computation ...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Estimation of Exponential-Polynomial Distribution by Holonomic Gradient Descent
We study holonomic gradient decent for maximum likelihood estimation of exponentialpolynomial distribution, whose density is the exponential function of a polynomial in the random variable. We first consider the case that the support of the distribution is the set of positive reals. We show that the maximum likelihood estimate (MLE) can be easily computed by the holonomic gradient descent, even...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Holonomic Gradient Method for the Distribution Function of the Largest Root of a Wishart Matrix
We apply the holonomic gradient method introduced by Nakayama et al. [19] to the evaluation of the exact distribution function of the largest root of a Wishart matrix, which involves the hypergeometric function 1F1 of a matrix argument. Compared to methods based on infinite series expansion in terms of zonal polynomials, whose convergence is slow, the proposed method is more practical for compu...
متن کاملSoftware Packages for Holonomic Gradient Method
We present software packages for the holonomic gradient method (HGM). These packages compute normalizing constants and the probabilities of some regions. While many algorithms which compute integrals over high-dimensional regions utilize the Monte-Carlo method, our HGM utilizes algorithms for solving ordinary differential equations such as the Runge-Kutta-Fehlberg method. As a result, our HGM c...
متن کاملMIMO Zero-Forcing Detection Performance Evaluation by Holonomic Gradient Method
We have recently derived infinite-series expressions for performance measures of multiple-input multipleoutput (MIMO) spatial multiplexing with zero-forcing detection (ZF) for Rician–Rayleigh fading, which is relevant in heterogeneous networks. These expressions ensue from a well-known infinite-series expansion around σ = 0 of the confluent hypergeometric function 1F1(·, ·, σ). Theoretically, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1211.6822 شماره
صفحات -
تاریخ انتشار 2012